Objective Functions for Balance in TraÆc Engineering

نویسندگان

  • Juan Alonso
  • Henrik Abrahamsson
  • Bengt Ahlgren
  • Anders Andersson
  • Per Kreuger
چکیده

We prove a result concerning objective functions that can be used to obtain eÆcient and balanced solutions to the multi-commodity network ow problem. This type of solution is of interest when routing traÆc in the Internet. A particular case of the result proved here (see Corollary 2 below) was stated without proof in a previous paper. Objective Functions for Balance in TraÆc Engineering? Juan Alonso, Henrik Abrahamsson, Bengt Ahlgren, Anders Andersson, and Per Kreuger SICS { Swedish Institute of Computer Science E-mail: [email protected] Abstract. We prove a result concerning objective functions that can be used to obtain eÆcient and balanced solutions to the multi-commodity network ow problem. This type of solution is of interest when routing traÆc in the Internet. A particular case of the result proved here (see Corollary 2 below) was stated without proof in a previous paper. We prove a result concerning objective functions that can be used to obtain eÆcient and balanced solutions to the multi-commodity network ow problem. This type of solution is of interest when routing traÆc in the Internet. A particular case of the result proved here (see Corollary 2 below) was stated without proof in a previous paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Analysis of Internet Di erentiated Services TraÆc

It is widely accepted that the next major requirement and milestone in the Internet is the ability to provide qualities of service to various applications. The Internet community and the standards bodies have been working on myriad schemes to achieve this objective. One of the prominent and promising approaches is being de ned and developed at the Di erentiated Services Working Group in IETF. W...

متن کامل

Dynamic Constrained Traffic Engineering for Multicast Routing

This paper presents a new traÆc engineering technique for dynamic constrained multicast routing, where routing request of traÆc arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traÆc engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwidth c...

متن کامل

Explicit multicast routing algorithms for constrained traffic engineering

|This paper presents a new traÆc engineering technique for dynamic constrained multicast routing, where the routing request of traÆc arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traÆc engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwi...

متن کامل

Solving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops

A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...

متن کامل

Understanding TraÆc Dynamics at a Backbone POP

Spatial and temporal information about traÆc dynamics is central to the design of e ective traÆc engineering practices for IP backbones. In this paper we study backbone traÆc dynamics using data collected at a major POP on a tier-1 IP backbone. We develop a methodology that combines packet-level traces from access links in the POP and BGP routing information to build components of POP-to-POP tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002